-
1 Логика переходов
General subject: State transition logic is formally defined within finite automata theory (см. Auslander D.M., Ridgely J.R., Ringgenberg J.D. Control Software for Mechanical Systems. Object-Oriented Design in a Real-Time World) -
2 логика переходов
General subject: State transition logic is formally defined within finite automata theory (см. Auslander D.M., Ridgely J.R., Ringgenberg J.D. Control Software for Mechanical Systems. Object-Oriented Design in a Real-Time World)
См. также в других словарях:
Switch-technology — is a technology for automata based programming support. It was proposed by Anatoly Shalyto in 1991. It involves software specification, design, implementation, debugging, documentation and maintenance. The term “automata based programming” is… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Petri net — A Petri net (also known as a place/transition net or P/T net) is one of several mathematical modeling languages for the description of distributed systems. A Petri net is a directed bipartite graph, in which the nodes represent transitions (i.e.… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
John von Neumann — Von Neumann redirects here. For other uses, see Von Neumann (disambiguation). The native form of this personal name is Neumann János. This article uses the Western name order. John von Neumann … Wikipedia